|
In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory. In a Boolean-valued model, the truth values of propositions are not limited to "true" and "false", but instead take values in some fixed complete Boolean algebra. Boolean-valued models were introduced by Dana Scott, Robert M. Solovay, and Petr Vopěnka in the 1960s in order to help understand Paul Cohen's method of forcing. They are also related to Heyting algebra semantics in intuitionistic logic. ==Definition== Fix a complete Boolean algebra ''B''〔''B'' here is assumed to be ''nondegenerate''; that is, 0 and 1 must be distinct elements of ''B''. Authors writing on Boolean-valued models typically take this requirement to be part of the definition of "Boolean algebra", but authors writing on Boolean algebras in general often do not.〕 and a first-order language ''L''; the signature of ''L'' will consist of a collection of constant symbols, function symbols, and relation symbols. A Boolean-valued model for the language ''L'' consists of a universe ''M'', which is a set of elements (or ''names''), together with interpretations for the symbols. Specifically, the model must assign to each constant symbol of ''L'' an element of ''M'', and to each ''n''-ary function symbol ''f'' of ''L'' and each ''n''-tuple <a0,...,a''n''-1> of elements of ''M'', the model must assign an element of ''M'' to the term ''f''(a0,...,a''n''-1). Interpretation of the atomic formulas of ''L'' is more complicated. To each pair ''a'' and ''b'' of elements of ''M'', the model must assign a truth value ||''a''=''b''|| to the expression ''a''=''b''; this truth value is taken from the Boolean algebra ''B''. Similarly, for each ''n''-ary relation symbol ''R'' of ''L'' and each ''n''-tuple <a0,...,a''n''-1> of elements of ''M'', the model must assign an element of ''B'' to be the truth value ||''R''(a0,...,a''n''-1)||. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Boolean-valued model」の詳細全文を読む スポンサード リンク
|